Swept volumes: void and boundary identification

نویسندگان

  • Karim Abdel-Malek
  • Harn-Jou Yeh
  • Saeb Othman
چکیده

A general formulation for determining complex sweeps comprising a multiple of parameters has been presented by the authors in recent work. This paper investigates the boundaries to swept volumes, and in specific, addresses the problem of determination of voids in the volume. The determination of voids has become of major concern in CAD software, where the accurate calculation of the swept volume is used in computing solid properties such as mass and moments of inertia. A mathematical formulation based on the concept of a normal acceleration function on singular surfaces is introduced. Criteria are derived regarding the identification of a boundary from the definiteness properties of the normal acceleration function. Numerical examples are illustrated in detail and represent the first treatment of void identification in complex sweeps. q 1999 Elsevier Science Ltd. All rights reserved

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0010-4485(98)00054-2

A general formulation for determining complex sweeps comprising a multiple of parameters has been presented by the authors in recent work. This paper investigates the boundaries to swept volumes, and in specific, addresses the problem of determination of voids in the volume. The determination of voids has become of major concern in CAD software, where the accurate calculation of the swept volum...

متن کامل

Computing swept volumes

The swept volume problem is practical, dif®cult and interesting enough to have received a great deal of attention over the years, and the literature contains much discussion of methods for computing swept volumes in many situations. The method presented here permits an arbitrary polyhedral object (given in a typical boundary representation) to be swept through an arbitrary trajectory. A polyhed...

متن کامل

Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes

We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and sweeping along a discrete rigid motion trajectory. Many previous methods focus on the construction of a polygonal superset (containing self-intersections and spurious internal geometry) ...

متن کامل

Swept Volumes

Given a solid S ⊂ R with a piecewise smooth boundary, we compute an approximation of the boundary surface of the volume which is swept by S under a smooth one-parameter motion. Using knowledge from kinematical and elementary differential geometry, the algorithm computes a set of points plus surface normals from the envelope surface. A study of the evolution speed of the so called characteristic...

متن کامل

High Quality Surface Mesh Generation for Swept Volumes ∗

We present a novel and efficient technique to generate a high quality mesh that approximates the outer boundary of a swept volume (SV). Our approach comes with two guarantees. First, the approximation is conservative, i.e. the swept volume is enclosed by the output mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined toleran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer-Aided Design

دوره 30  شماره 

صفحات  -

تاریخ انتشار 1998